deal: A Package for Learning Bayesian Networks

deal is a software package for use with R. It includes several methods for analysing data using Bayesian networks with variables of discrete and/or continuous types but restricted to conditionally Gaussian networks. Construction of priors for network parameters is supported and their parameters can be learned from data using conjugate updating. The network score is used as a metric to learn the structure of the network and forms the basis of a heuristic search strategy. deal has an interface to Hugin.

Supporting Constructive Learning with a Feedback Planner

A promising approach to constructing more effective computer tutors is implementing tutorial strategies that extend over multiple turns. This means that computer tutors must deal with (1) failure, (2) interruptions, (3) the need to revise their tactics, and (4) basic dialogue phenomena such as acknowledgment. To deal with these issues, we need to combine ITS technology with advances from robotics and computational linguistics. We can use reactive planning techniques from robotics to allow us to modify tutorial plans, adapting them to student input. Computational linguistics will give us guidance in handling communication management as well as building a reusable architecture for tutorial dialogue systems. A modular and reusable architecture is critical given the difficulty in constructing tutorial dialogue systems and the many domains to which we would like to apply them. In this paper, we propose such an architecture and discuss how a reactive planner in the context of this architecture can implement multi-turn tutorial strategies

Accelerated convergence for incompressible flow calculations

Two improved algorithms which solve the steady-state Navier-Stokes equations, PISO and SIMPLER, are studied. Computations were carried out on progressively finer grids for the driven cavity and flow over a backward-facing step. The effects of relaxation factor, number of grid nodes and number of sweeps through the pressure equations are studied to evaluate the performance of the PISO and SIMPLER schemes. Results show that these improved schemes accelerate the convergence rate of the solution generally by a factor of two as compared to the SIMPLE method

Organic Farming Scenarios: Operational Analysis and Costs of implementing Innovative Technologies

The objective of this study has been to design a number of farm scenarios representing future plausible and internally consistent organic farming enterprises based on milk, pig, and plant production and use these farm scenarios as the basis for the generation of generalised knowledge on labour and machinery input and costs. Also, an impact analysis and feasibility study of introducing innovative technologies into the organic production system has been invoked. The labour demand for the production farms ranged from 61 to 253hha1 and from 194 to 396hLU1 (LU is livestock units) for work in the animal houses. Model validation results showed that farm managerial tasks amount to 14–19% of the total labour requirement. The impact of introducing new technologies and work methods related to organic farming was evaluated using two innovative examples of weed control: a weeding robot and an integrated system for band steaming. While these technologies increased the capital investment required, the labour demand was reduced by 83–85% in sugar beet and 60% in carrots, which would improve profitability by 72–85% if fully utilised. Profitability is reduced, if automation efforts result in insufficient weed removal compared to manual weeding. Specifically, the benefit gained by robotic weeding was sensitive to the weed intensity and the initial price of the equipment, but a weeding efficiency of under 25% is required to make it unprofitable. This approach demonstrates the feasibility of applying and testing operational models in organic farming systems in the continued evaluation and documentation of labour and machinery inputs

A New Supersymmetric Extension of Conformal Mechanics

In this paper a new supersymmetric extension of conformal mechanics is put forward. The beauty of this extension is that all variables have a clear geometrical meaning and the super-Hamiltonian turns out to be the Lie-derivative of the Hamiltonian flow of standard conformal mechanics. In this paper we also provide a supersymmetric extension of the other conformal generators of the theory and find their "square-roots". The whole superalgebra of these charges is then analyzed in details. We conclude the paper by showing that, using superfields, a constraint can be built which provides the exact solution of the system.Comment: 11 pages, no figure

Regional Indexes of Activity: Combining the Old with the New

This paper proposes a framework to construct indexes of activity which links two strands of the index literature – the traditional business cycle analysis and the latent variable approach. To illustrate the method, we apply the framework to Australian regional data, namely to two resource-rich and two service-based states. The results reveal differences in the evolution and drivers of economic activity across the four states. We also demonstrate the value of the Index in a broader context by using a structural vector autoregression (SVAR) approach to analyse the effects of shocks from the US and from China. This Index-SVAR approach facilitates a richer analysis because the unique feature of the index method proposed here allows impulse responses to be traced back to the components.Regional economic activity, coincident indicators, dynamic latent factor model

Functional Sites Induce Long-Range Evolutionary Constraints in Enzymes

Functional residues in proteins tend to be highly conserved over evolutionary time. However, to what extent functional sites impose evolutionary constraints on nearby or even more distant residues is not known. Here, we report pervasive conservation gradients toward catalytic residues in a dataset of 524 distinct enzymes: evolutionary conservation decreases approximately linearly with increasing distance to the nearest catalytic residue in the protein structure. This trend encompasses, on average, 80% of the residues in any enzyme, and it is independent of known structural constraints on protein evolution such as residue packing or solvent accessibility. Further, the trend exists in both monomeric and multimeric enzymes and irrespective of enzyme size and/or location of the active site in the enzyme structure. By contrast, sites in protein–protein interfaces, unlike catalytic residues, are only weakly conserved and induce only minor rate gradients. In aggregate, these observations show that functional sites, and in particular catalytic residues, induce long-range evolutionary constraints in enzymes.Fil: Jack, Benjamin R.. University of Texas at Austin; Estados UnidosFil: Meyer, Austin G.. University of Texas at Austin; Estados UnidosFil: Echave, Julián. Universidad Nacional de San Martín. Escuela de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Wilke, Claus O.. University of Texas at Austin; Estados Unido

Bidding for envy-freeness: A procedural approach to n-player fair-division problems

We develop a procedure for implementing an efficient and envy-free allocation of m objects among n individuals with the possibility of monetary side-payments. The procedure eliminates envy by compensating envious players. It is fully descriptive and says explicitly which compensations should be made, and in what order. Moreover, it is simple enough to be carried out without computer support. We formally characterize the properties of the procedure, show how it establishes envy-freeness with minimal resources, and demonstrate its application to a wide class of fair-division problems.fair-division procedures, envy-freeness